We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.
展开▼